Applications of the Harary-Sachs theorem for hypergraphs
نویسندگان
چکیده
The Harary-Sachs theorem for k-uniform hypergraphs equates the codegree-d coefficient of adjacency characteristic polynomial a uniform hypergraph with weighted sum subgraph counts over certain multi-hypergraphs d edges. We begin by showing that classical graphs is indeed special case this general theorem. To end we apply generalized to leading coefficients various hypergraphs. In particular, provide explicit and asymptotic formulas contribution simplex coefficient. Moreover, an formula terms 3-uniform further show how can be used determine complete spectrum hypergraph. conclude conjecture concerning multiplicity zero-eigenvalue
منابع مشابه
The Generalization of Dirac's Theorem for Hypergraphs
A substantial amount of research in graph theory continues to concentrate on the existence of hamiltonian cycles and perfect matchings. A classic theorem of Dirac states that a sufficient condition for an n-vertex graph to be hamiltonian, and thus, for n even, to have a perfect matching, is that the minimum degree is at least n/2. Moreover, there are obvious counterexamples showing that this is...
متن کاملThree-center Harary index and its applications
The Harary index H can be viewed as a molecular structure descriptor composed of increments representing interactions between pairs of atoms, such that their magnitude decreases with the increasing distance between the respective two atoms. A generalization of the Harary index, denoted by Hk, is achieved by employing the Steiner-type distance between k-tuples of atoms. We show that the linear c...
متن کاملMantel's theorem for random hypergraphs
A cornerstone result in extremal graph theory is Mantel’s Theorem, which states that every maximum triangle-free subgraph of Kn is bipartite. A sparse version of Mantel’s Theorem is that, for sufficiently large p, every maximum triangle-free subgraph of G(n, p) is w.h.p. bipartite. Recently, DeMarco and Kahn proved this for p > K √ log n/n for some constant K, and apart from the value of the co...
متن کاملThe Tree-Width Compactness Theorem for Hypergraphs
A hypergraph H has tree-width k (a notion introduced by Robertson and Seymour) if k is the least integer such that H admits a tree-decomposition of tree-width k. We prove a compactness theorem for this notion, that is, if every finite subhypergraph of H has tree-width < k, then H itself has tree-width < k. This result will be used in a later paper on well-quasi-ordering infinite graphs.
متن کاملstudy of cohesive devices in the textbook of english for the students of apsychology by rastegarpour
this study investigates the cohesive devices used in the textbook of english for the students of psychology. the research questions and hypotheses in the present study are based on what frequency and distribution of grammatical and lexical cohesive devices are. then, to answer the questions all grammatical and lexical cohesive devices in reading comprehension passages from 6 units of 21units th...
ذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2022
ISSN: ['1873-1856', '0024-3795']
DOI: https://doi.org/10.1016/j.laa.2022.05.012